Testing for separability is hard
نویسنده
چکیده
This paper shows that it is computationally hard to decide (or test) whether a consumption data set is consistent with separable preferences.
منابع مشابه
Weak Separability Testing And Estimation Of Selected Food Commodities Demand System In Urban Households Of Iran (Case Study of: Citrus Fruits, Cucurbits and Vegetables)
The separability of consumer desires is a necessary and sufficient condition for multi-stage budgeting and Collectivization is consistent of commodity where costs are allocated between edible groups using price indices and intergroup allocations are made independently of other groups. Given the high share of Citrus fruits, Cucurbits and vegetables types (29/5% percent of household food and beve...
متن کاملSeparability by piecewise testable languages is PTime-complete
Piecewise testable languages form the first level of the Straubing-Thérien hierarchy. The membership problem for this level is decidable and testing if the language of a DFA is piecewise testable is NL-complete. The question has not yet been addressed for NFAs. We fill in this gap by showing that it is PSpace-complete. The main result is then the lower-bound complexity of separability of regula...
متن کاملDoes linear separability really matter? Complex visual search is explained by simple search.
Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is...
متن کاملA Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem
In this article we consider the problem of testing, for two finite sets of points in the Euclidean space, if their convex hulls are disjoint and computing an optimal supporting hyperplane if so. This is a fundamental problem of classification in machine learning known as the hard-margin SVM. The problem can be formulated as a quadratic programming problem. The SMO algorithm [1] is the current s...
متن کاملEvaluation of Tests for Separability and Symmetry of Spatio-temporal Covariance Function
In recent years, some investigations have been carried out to examine the assumptions like stationarity, symmetry and separability of spatio-temporal covariance function which would considerably simplify fitting a valid covariance model to the data by parametric and nonparametric methods. In this article, assuming a Gaussian random field, we consider the likelihood ratio separability test, a va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.4499 شماره
صفحات -
تاریخ انتشار 2014